Weak type classes

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Restricted Weak Type versus Weak Type

We prove that translation invariant multilinear operators of restricted weak type (1, 1, . . . , 1, q) must necessarily be of weak type (1, 1, . . . , 1, q). We give applications.

متن کامل

Differential-Linear Weak Key Classes of IDEA

Large weak key classes of IDEA are found for which membership is tested with a differential-linear test while encrypting with a single key. In particular, one in every 2'' keys for 8.5-round IDEA is weak. A related-key differential-linear attack on 4-round IDEA is presented which is successful for all keys. Large weak key classes are found for 4.5to 6.5-round and 8-round IDEA for which membersh...

متن کامل

Weak Equivalence Classes of Complex Vector Bundles

For any complex vector bundle Ek of rank k over a manifold Mm with Chern classes ci ∈ H2i(Mm, Z) and any non-negative integers l1, · · · , lk we show the existence of a positive number p(m, k) and the existence of a complex vector bundle Êk over Mm whose Chern classes are p(m, k) · li · ci ∈ H2i(Mm, Z). We also discuss a version of this statement for holomorphic vector bundles over projective a...

متن کامل

New Weak-Key Classes of IDEA

This paper presents a large collection of new weak-key classes for the IDEA cipher. The classes presented in this paper contain 2−2 weak keys (as compared with 2 differential weak keys presented by Daemen at CRYPTO’93 and 2 differential-linear weak-keys presented by Hawkes at EUROCRYPT’98). The novelty of our approach is in the use of boomerang distinguishers for the weak-key class membership t...

متن کامل

Type Reconstruction for Type Classes

We study the type inference problem for a system with type classes as in the functional programming language Haskell. Type classes are an extension of ML-style polymorphism with overloading. We generalize Milner’s work on polymorphism by introducing a separate context constraining the type variables in a typing judgement. This leads to simple type inference systems and algorithms which closely ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Functional Analysis

سال: 1983

ISSN: 0022-1236

DOI: 10.1016/0022-1236(83)90088-5